A Biologically Inspired Algorithm for Low Energy Clustering Problem in Body Area Network
نویسندگان
چکیده
منابع مشابه
Hybrid Bio-Inspired Clustering Algorithm for Energy Efficient Wireless Sensor Networks
In order to achieve the sensing, communication and processing tasks of Wireless Sensor Networks, an energy-efficient routing protocol is required to manage the dissipated energy of the network and to minimalize the traffic and the overhead during the data transmission stages. Clustering is the most common technique to balance energy consumption amongst all sensor nodes throughout the network. I...
متن کاملFuzzy Particle Swarm Optimization Algorithm for a Supplier Clustering Problem
This paper presents a fuzzy decision-making approach to deal with a clustering supplier problem in a supply chain system. During recent years, determining suitable suppliers in the supply chain has become a key strategic consideration. However, the nature of these decisions is usually complex and unstructured. In general, many quantitative and qualitative factors, such as quality, price, and fl...
متن کاملA biologically inspired model for transshipment problem
Transshipment problem is one of the basic operational research problems. In this paper, our first work is to develop a biologically inspired mathematical model for a dynamical system, which is first used to solve minimum cost flow problem. It has lower computational complexity than Physarum Solver. Second, we apply the proposed model to solve the traditional transshipment problem. Compared with...
متن کاملA quantum-inspired evolutionary clustering algorithm for the lifetime problem of wireless sensor network
One of the solutions to the lifetime problem of a wireless sensor network (WSN) is to select a sensor as the cluster head (CH) to reduce the transmission cost of the other sensors in a cluster. However, the high computation load will quickly run out of its energy. The most well-known method for selecting the CHs of a WSN is the so-called low energy adaptive clustering hierarchy (LEACH), but it ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Sensors
سال: 2021
ISSN: 1687-7268,1687-725X
DOI: 10.1155/2021/5525602